Perfect matchings, eigenvalues and expansion
نویسنده
چکیده
In this note, we prove a sufficient condition for the existence of a perfect matching in a regular graph in terms of its eigenvalues and its expansion constant. We improve a recent result of Brouwer and Haemers. French version: Dans cette note, nous prouvons un état suffisant pour l’existence d’un assortiment parfait dans un graphe régulier en termes de ses valeurs propres et son constante d’expansion. Nous améliorons un résultat récent de Brouwer et Haemers.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملEnumeration of perfect matchings of a type of Cartesian products of graphs
Let G be a graph and let Pm(G) denote the number of perfect matchings of G. We denote the path with m vertices by Pm and the Cartesian product of graphs G and H byG×H . In this paper, as the continuance of our paper [W.Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175–188], we enumerate perfect matchings in a type of ...
متن کامل0 O ct 2 00 8 CLUSTER EXPANSION FORMULAS AND PERFECT MATCHINGS
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain graph GT,γ that is constructed from the surface by recursive glueing of elementary pieces that we call tiles. We also give a second formula...
متن کاملCluster Expansion Formulas and Perfect Matchings
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain graph GT,γ that is constructed from the surface by recursive glueing of elementary pieces that we call tiles. We also give a second formula...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کامل